Automatic Fetal Measurements in Ultrasound Using Constrained Probabilistic Boosting Tree

نویسندگان

  • Gustavo Carneiro
  • Bogdan Georgescu
  • Sara Good
  • Dorin Comaniciu
چکیده

Automatic delineation and robust measurement of fetal anat-omical structures in 2D ultrasound images is a challenging task due to the complexity of the object appearance, noise, shadows, and quantity of information to be processed. Previous solutions rely on explicit encoding of prior knowledge and formulate the problem as a perceptual grouping task solved through clustering or variational approaches. These methods are known to be limited by the validity of the underlying assumptions and cannot capture complex structure appearances. We propose a novel system for fast automatic obstetric measurements by directly exploiting a large database of expert annotated fetal anatomical structures in ultrasound images. Our method learns to distinguish between the appearance of the object of interest and background by training a discriminative constrained probabilistic boosting tree classifier. This system is able to handle previously unsolved problems in this domain, such as the effective segmentation of fetal abdomens. We show results on fully automatic measurement of head circumference, biparietal diameter, abdominal circumference and femur length. Unparalleled extensive experiments show that our system is, on average, close to the accuracy of experts in terms of segmentation and obstetric measurements. Finally, this system runs under half second on a standard dual-core PC computer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detection of Fetal Anatomies from Ultrasound Images using a Constrained Probabilistic Boosting Tree

We propose a novel method for the automatic detection and measurement of fetal anatomical structures in ultrasound images. This problem offers a myriad of challenges, including: difficulty of modeling the appearance variations of the visual object of interest; robustness to speckle noise and signal drop-out; and large search space of the detection procedure. Previous solutions typically rely on...

متن کامل

Automatic measurement of instantaneous changes in the walls of carotid artery with sequential ultrasound images

Introduction: This study presents a computerized analyzing method for detection of instantaneous changes of far and near walls of the common carotid artery in sequential ultrasound images by applying the maximum gradient algorithm. Maximum gradient was modified and some characteristics were added from the dynamic programming algorithm for our applications. Methods: The algorithm was evaluat...

متن کامل

Bayes Networks and Fault Tree Analysis Application in Reliability Estimation (Case Study: Automatic Water Sprinkler System)

In this study, the application of Bayes networks and fault tree analysis in reliability estimation have been investigated. Fault tree analysis is one of the most widely used methods for estimating reliability. In recent years, a method called "Bayes Network" has been used, which is a dynamic method, and information about the probable failure of the system components will be updated according to...

متن کامل

Difference of Gaussians revolved along elliptical paths for ultrasound fetal head segmentation

We present a fully automatic method to segment the skull from 2-D ultrasound images of the fetal head and to compute the standard biometric measurements derived from the segmented images. The method is based on the minimization of a novel cost function. The cost function is formulated assuming that the fetal skull has an approximately elliptical shape in the image and that pixel values within t...

متن کامل

A Theory of Probabilistic Boosting, Decision Trees and Matryoshki

We present a theory of boosting probabilistic classifiers. We place ourselves in the situation of a user who only provides a stopping parameter and a probabilistic weak learner/classifier and compare three types of boosting algorithms: probabilistic Adaboost, decision tree, and tree of trees of ... of trees, which we call matryoshka. “Nested tree,” “embedded tree” and “recursive tree” are also ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention

دوره 10 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2007